Kernel group sparse representation classifier via structural and non-convex constraints
نویسندگان
چکیده
منابع مشابه
Deblocking Joint Photographic Experts Group Compressed Images via Self-learning Sparse Representation
JPEG is one of the most widely used image compression method, but it causes annoying blocking artifacts at low bit-rates. Sparse representation is an efficient technique which can solve many inverse problems in image processing applications such as denoising and deblocking. In this paper, a post-processing method is proposed for reducing JPEG blocking effects via sparse representation. In this ...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملKernel sparse representation based classification
Sparse representation has attracted great attention in the past few years. Sparse representation based classification (SRC) algorithm was developed and successfully used for classification. In this paper, a kernel sparse representation based classification (KSRC) algorithm is proposed. Samples are mapped into a high dimensional feature space first and then SRC is performed in this new feature s...
متن کاملImage Compressive Sensing Recovery Using Group Sparse Coding via Non-convex Weighted Lp Minimization
Compressive sensing (CS) has attracted considerable research from signal/image processing communities. Recent studies further show that structured or group sparsity often leads to more powerful signal reconstruction techniques in various CS taskes. Unlike the conventional sparsity-promoting convex regularization methods, this paper proposes a new approach for image compressive sensing recovery ...
متن کاملNon-convex Sparse Regularization
We study the regularising properties of Tikhonov regularisation on the sequence space l with weighted, non-quadratic penalty term acting separately on the coefficients of a given sequence. We derive sufficient conditions for the penalty term that guarantee the well-posedness of the method, and investigate to which extent the same conditions are also necessary. A particular interest of this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2018
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2018.03.035